منابع مشابه
Vertex-Fault-Tolerant Hamiltonicity of Cube-Connected Cycles Graphs
The graph CCCn has n × 2 vertices, labeled (l,x), where l is an integer between 0 and n − 1 and x is an n-bit binary string. Two vertices (l,x) and (l′,y) are adjacent if and only if either x = y and |l − l′| = 1, or l = l′ and y = (x). A graph G is called k-vertex-fault-tolerant hamiltonian if it remains hamiltonian after removing at most k vertices. In this paper, we will prove that CCCn is 1...
متن کاملA cycle embedding problem for Cube-Connected Cycles Graphs
Let n be an odd integer with n ≥ 3. The cube-connected cycles graph CCCn has n × 2 vertices, labeled (l,x), where 0 ≤ l ≤ n − 1 and x is an n-bit binary string. Two vertices (l,x) and (l′,y) are adjacent if and only if either x = y and |l − l′| = 1, or l = l′ and y = (x). In this paper, we will find the set of all possible lengths of cycles in CCCn with n is odd and n ≥ 3 .
متن کاملEmbedding Cube-Connected Cycles Graphs into Faulty Hypercubes
AbstructWe consider the problem of embedding a cubeconnected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a l i t of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of the faulty edges. The algorithm has optimal running time and tolerates the maximum number of faults (in a worst-case setting). Because...
متن کاملCycles in 2-connected graphs
Let Gn be a class of graphs on n vertices. For an integer c, let ex(Gn, c) be the smallest integer such that if G is a graph in Gn with more than ex(Gn, c) edges, then G contains a cycle of length more than c. A classical result of Erdös and Gallai is that if Gn is the class of all simple graphs on n vertices, then ex(Gn, c) = c 2 (n − 1). The result is best possible when n − 1 is divisible by ...
متن کاملCube Connected Cycles Based Bluetooth Scatternet Formation
Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.11.021